Random Partitions with Non-negative rth Differences
نویسندگان
چکیده
منابع مشابه
Random Partitions with Non Negative rth Differences
Let Pr(n) be the set of partitions of n with non negative r th differences. Let λ be a partition of an integer n chosen uniformly at random among the set Pr(n) Let d(λ) be a positive r th difference chosen uniformly at random in λ. The aim of this work is to show that for every m ≥ 1, the probability that d(λ) ≥ m approaches the constant m−1/r as n → ∞ This work is a generalization of a result ...
متن کاملNon-crossing Linked Partitions and Multiplication of Free Random Variables
The material gives a new combinatorial proof of the multiplicative property of the S-transform. In particular, several properties of the coefficients of its inverse are connected to non-crossing linked partitions and planar trees. AMS subject classification: 05A10 (Enumerative Combinatorics); 46L54(Free Probability and Free Operator Algebras).
متن کاملRandom partitions with restricted part sizes
For a subsetS of positive integers let (n,S)be the set of partitions ofn into summands that are elements of S. For every λ ∈ (n,S), let Mn(λ) be the number of parts, with multiplicity, that λ has. Put a uniform probability distribution on (n,S), and regardMn as a random variable. In this paper the limiting density of the (suitably normalized) random variableMn is determined for sets that are su...
متن کاملExact Finite Differences. The Derivative on Non Uniformly Spaced Partitions
We define a finite-differences derivative operation, on a non uniformly spaced partition, which has the exponential function as an exact eigenvector. We discuss some properties of this operator and we propose a definition for the components of a finite-differences momentum operator. This allows us to perform exact discrete calculations.
متن کاملSpectra of Random Graphs with Planted Partitions
Spectral methods for clustering are now standard, and there are many toy examples in which they can be seen to yield more sensible solutions than classical schemes like vanilla k-means. A more rigorous analysis of these methods has proved elusive, however, and has so far consisted mostly of probabilistic analyses for random inputs with planted clusterings. Such an analysis, typically calls for ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Applied Mathematics
سال: 2001
ISSN: 0196-8858
DOI: 10.1006/aama.2001.0736